Loop models with crossings
نویسندگان
چکیده
منابع مشابه
Coloring graphs with crossings
We generalize the Five Color Theorem by showing that it extends to graphs with two crossings. Furthermore, we show that if a graph has three crossings, but does not contain K6 as a subgraph, then it is also 5-colorable. We also consider the question of whether the result can be extended to graphs with more crossings.
متن کاملon some bayesian statistical models in actuarial science with emphasis on claim count
چکیده ندارد.
15 صفحه اولInhomogeneous loop models with open boundaries
We consider the crossing and non-crossing O(1) dense loop models on a semi-infinite strip, with inhomogeneities (spectral parameters) that preserve the integrability. We compute the components of the ground state vector and obtain a closed expression for their sum, in the form of Pfaffian and determinantal formulas.
متن کاملConformal boundary loop models
We study a model of densely packed self-avoiding loops on the annulus, related to the Temperley Lieb algebra with an extra idempotent boundary generator. Four different weights are given to the loops, depending on their homotopy class and whether they touch the outer rim of the annulus. When the weight of a contractible bulk loop x ≡ q + q ∈ (−2, 2], this model is conformally invariant for any ...
متن کاملDrawing Graphs with Right Angle Crossings
Cognitive experiments show that humans can read graph drawings in which all edge crossings are at right angles equally well as they can read planar drawings; they also show that the readability of a drawing is heavily affected by the number of bends along the edges. A graph visualization whose edges can only cross perpendicularly is called a RAC (Right Angle Crossing) drawing. This paper initia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2013
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.87.184204